/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
double N;
ll x, y;
int main()
{
    IOS;
    cin >> N >> x >> y;
    double ans = N;
    ll fail_day = 0;
    double fail = N / 32.0;
    bool flag = true;
    for (ll i = 1; i <= y; i++)
    {
        ans = 2 * ans / 3.0;
        if (i >= x && flag)
        {
            ans += (N / 2);
            flag = false;
        }
        if (ans * 32 < N)
        {
            fail_day = i;
            break;
        }
    }
    if (fail_day > 0)
    {
        printf("N0!\n%lld %.6f\n", fail_day, ans);
    }
    else
    {
        printf("YE5!\n%.6f\n", ans);
    }
    getchar();
    getchar();
    return 0;
}
